VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
نویسندگان
چکیده
منابع مشابه
Variable Neighborhood Search for Order Batching in a Warehouse
In this paper we address the problem of batching orders in a warehouse, with the objective of minimizing the total travel time. Order batching is an NP-hard optimization problem that is very difficult to solve exactly in practice. Thus, most implemented solutions are based on elementary heuristic methods that perform a relatively limited exploration of the solution space. As an alternative, we ...
متن کاملIntegrated Order Batching and Distribution Scheduling in a Single-block Order Picking Warehouse Considering S-Shape Routing Policy
In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...
متن کاملInvestigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملGeneral Variable Neighborhood Search applied to the picking process in a warehouse
The order batching problem is a part of the picking process of items in a warehouse. A set of items conform an order and a set of orders conform a batch. The problem consist of grouping the orders received in the warehouse in different batches. Each batch have to be collected by a single picker without exceed a capacity limit. The objective is to minimize the total time needed to collect all th...
متن کاملA variable neighborhood search for graph coloring
Descent methods for combinatorial optimization proceed by performing a sequence of local changes on an initial solution which improve each time the value of an objective function until a local optimum is found. Several metaheuristics have been proposed which extend in various ways this scheme and avoid being trapped in local optima. For example, Hansen and Mladenovic have recently proposed the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asia-Pacific Journal of Operational Research
سال: 2009
ISSN: 0217-5959,1793-7019
DOI: 10.1142/s0217595909002390